Welcome Guest

Questions for GLOBAL LOGIC


Aptitude And Technical Questions For GLOBAL LOGIC
           View All Aptitude And Technical Questions
Q. No. : 1
Question :A man ate 100 bananas in five days, each day eating 6 more than the previous day. How many bananas did he eat on the first day?
A :
6
B :
9
C :
8
D :
7
Answer: C
Q. No. : 2
Question :A towel, when bleached, was found to have lost 20% of its length and 10% of its breadth. The percentage of decrease in area is:
A :
10%
B :
10.08%
C :
20%
D :
28%
Answer: D
Solution
Q. No. : 3
Question :A monkey starts climbing up a tree 20ft. tall. Each hour, it hops 3ft. and slips back 2ft. How much time would it take the monkey to reach the top?
A :
15
B :
20
C :
21
D :
18
Answer: D
Q. No. : 4
Question :x, y, z are distinct integers such as x is positive, y is lesser than x and z is more than x and y. Then which of the following is true ?
A :
x y³
B :
x-y > 0
C :
xyz>0
D :
none of these
Answer: B
Q. No. : 5
Question :Train X starts from A towards B which is 180 Kms apart. At same time, train Y start from B towards A. Train X travels at speed of 70 kmph and Y travels at 50 kmph. While X does not stop anywhere on the way, the train Y stops at station C in between at 60km from B for 15 minutes. At what distance from A they would meet
A :
115
B :
112
C :
129
D :
none of these
Answer: B
Solution
Q. No. : 6
Question :Find the output for the following C program
 int i =10 main()
 {
int i =20,n;
for(n=0;n<=i;)
{
int i=10; i++;
}
printf("%d", i);
}

A :
10
B :
garbage value
C :
20
D :
compilation error
Answer: C
Q. No. : 7
Question :Consider the declaration

int a=5,*b=&a;
The statement
printf("%D",a*b);

prints
A :
25
B :
garbage
C :
5 x address of b
D :
an error message
Answer: D
Solution
Q. No. : 8
Question :A possible output of the following program fragment
static char wer[ ][5]={"harmot","merli","axari"};
printf("%d%d%d",wer,wer[0],&wer[0][0]);
is
A :
262164 262164 262164
B :
262164 262165 262166
C :
262164 262165 262165
D :
262164 262164 262165
Answer: A
Q. No. : 9
Question :What will be the result of the following program ?
char *gxxx()
{static char xxx[1024];
return xxx;
}

main()
{char *g="string";
strcpy(gxxx(),g);
g = gxxx();
strcpy(g,"oldstring");
printf("The string is : %s",gxxx());
}
A :
The string is : string

B :
The string is :Oldstring

C :
Run time error/Core dump

D :
Syntax error during compilation

Answer: B
Q. No. : 10
Question :Consider the following program segment
i=6720; j=4;
while((i%j)==0)
{
i=i/j;
j=j+1;
}

on termination j will have the value
A :
4
B :
8
C :
9
D :
6720
Answer: C
Q. No. : 11
Question :In linked lists there are no NULL links in:
A :
Sin­gle linked list
B :
Lin­ear dou­bly linked list
C :
cir­cu­lar linked list
D :
None of the above
Answer: C
Q. No. : 12
Question :In an array representation of binary tree the right child of root will be at location of
A :
2
B :
5
C :
3
D :
0
Answer: C
Q. No. : 13
Question :3. Which of the following data structures are indexed structures?
A :
linear arrays
B :
linked lists
C :
both of above
D :
none of above
Answer: A
Q. No. : 14
Question : The total number of comparisons in a bubble sort is
A :
O(n log n)
B :
O(2n)
C :
O(n2)
D :
None of the above
Answer: C
Q. No. : 15
Question :The result of evaluating prefix expression */b+-dacd, where a = 3, b = 6, c = 1, d = 5 is
A :
0
B :
5
C :
10
D :
15
Answer: C
Solution
Q. No. : 16
Question :The merging two sorted lists of size m and n into a sorted lists of size m+n , we require comparisions of
A :
O(m)
B :
O(n)
C :
O(m+n)
D :
O(log(m)+log(n))
Answer: C
Q. No. : 17
Question :A sorting algorithm which can prove to be a best time algorithm in one case and a worst time algorithm in worst case is
A :
Quick Sort
B :
Heap Sort
C :
Merge Sort
D :
Insert Sort
Answer: A
Q. No. : 18
Question :A shift register can be used for
A :
Parallel to serial conversion
B :
Serial to parallel conversion
C :
Digital delay line
D :
All the above
Answer: D
Q. No. : 19
Question : The worst case successful search time for sequential search on n items is
A :
n
B :
(n-1)/2
C :
(n+1)/2
D :
log(n)+1
Answer: A
Q. No. : 20
Question :The average successful search time for sequential search on n items is
A :
n/2
B :
(n-1)/2
C :
(n+1)/2
D :
log(n)+1
Answer: C
Q. No. : 21
Question :Which of the following cannot be declared static?
A :
Class
B :
inline function
C :
Functions
D :
Member variables
Answer: A
Q. No. : 22
Question :Which of the following parameter passing mechanism is/are supported by C++,but not by C?
A :
Pass by value
B :
Pass by reference
C :
Pass by value result
D :
All of the above
Answer: B
Q. No. : 23
Question :Choose the correct statement regarding inline functions
A :
It speeds up execution
B :
It slows down the execution
C :
It increases the code size
D :
It decreases the code size
Answer: C